Redundancy Aware Clustering via Centroid Localization Technique
نویسندگان
چکیده
This paper investigates the energy-saving organization of sensor nodes in large wireless sensor networks. Due to a random deployment used in many application scenarios, much more nodes need to be deployed to achieve a complete sensor coverage than theoretically needed in case of an ideal deployment. Consequently, most of the deployed nodes are redundant and can be switched-off for a long time to save energy. A well-known principle to detect the redundancy of nodes is to divide sensor network into regular cells. Assuming a well chosen cell size, depending on transmission range and sensing range, it is possible to switch-off all nodes but one per cell. The challenge of this idea is the required exact position estimation of each node to assign its correct cell. This demands for the presence of location aware anchor node and consumes a lot of calculation and transmissions and may be even unachievable. Centroid localization is an already used approach which localizes an unknown position as the centroid of neighboring beacon nodes. Depending on several parameters, an area will be divided into subareas where all unknowns are neighbors of the same beacon nodes and are therefore located at the same point. The resulting subareas differ in shape and size. In the current work, we combine the centroid localization technique and the cell division idea. With regular arranged beacons, we utilize the emerging cells for the detection of redundant nodes. Thereby, our beacon based clustering guarantees connectivity, coverage and energy-aware network activity.
منابع مشابه
EIDA: An Energy-Intrusion aware Data Aggregation Technique for Wireless Sensor Networks
Energy consumption is considered as a critical issue in wireless sensor networks (WSNs). Batteries of sensor nodes have limited power supply which in turn limits services and applications that can be supported by them. An efcient solution to improve energy consumption and even trafc in WSNs is Data Aggregation (DA) that can reduce the number of transmissions. Two main challenges for DA are: (i)...
متن کاملRessourcenarme und dezentrale Lokalisierung autonomer Sensorknoten in Sensornetzwerken
Sensor networks consist of a mass of resource-critical and autarchic simple sensor nodes. Initially, these sensor nodes have to organize and localize autonomously. The localization process of these randomly deployed nodes must meet numerous strong conditions of small data memories, limited energy sources, a small bandwidth and others. In this work, lots of the already published range estimation...
متن کاملScalable Kernel k-Means via Centroid Approximation
Although kernel k-means is central for clustering complex data such as images and texts by implicit feature space embedding, its practicality is limited by the quadratic computational complexity. In this paper, we present a novel technique based on scalable centroid approximation that accelerates kernel k-means down to a sub-quadratic complexity. We prove near-optimality of our algorithm, and e...
متن کاملCentre-based Hard Clustering Algorithms for Y-str Data
This paper presents Centre-based hard clustering approaches for clustering Y-STR data. Two classical partitioning techniques: Centroid-based partitioning technique and Representative object-based partitioning technique are evaluated. The k-Means and the k-Modes algorithms are the fundamental algorithms for the centroid-based partitioning technique, whereas the k-Medoids is a representative obje...
متن کاملRange Free Localization Schemes for Wireless Sensor Networks
Wireless sensor networks have become a hot research area due to their numerous applications in monitoring inaccessible areas, which are difficult to be monitored by conventional methods. A large number of wireless sensor network based applications are location dependent, where the sensed data is meaningless without accurate location of its origin. Some of these applications require highly accur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010